Trust region affine scaling algorithms for linearly constrained convex and concave programs

We study a trust region affine scaling algorithm for solving the linearly constrained convex or concave programming problem. Under primal nondegeneracy assumption, we prove that every accumulation point of the sequence generated by the algorithm satisfies the first order necessary condition for optimality of the problem. For a special class of convex or concave functions satisfying a certain invariance condition on their Hessians, it is shown that the sequences of iterates and objective function values generated by the algorithm convergeR-linearly andQ-linearly, respectively. Moreover, under primal nondegeneracy and for this class of objective functions, it is shown that the limit point of the sequence of iterates satisfies the first and second order necessary conditions for optimality of the problem. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.The work of these authors was based on research supported by the National Science Foundation under grant INT-9600343 and the Office of Naval Research under grants N00014-93-1-0234 and N00014-94-1-0340.     

Semi‐analytical method for departure point determination

A new method for departure point determination on Cartesian grids, the semi‐analytical upwind path line tracing (SUT) method, is presented and compared to two typical departure point determination methods used in semi‐Lagrangian advection schemes, the Euler method and the four‐step Runge–Kutta method. Rigorous comparisons of the three methods were conducted for a severely curving hypothetical flow field and for advective transport in the rotation of a Gaussian concentration hill. The SUT method was shown to have equivalent accuracy to the Runge–Kutta method but with significantly improved computational efficiency. Depending on the case being simulated, the SUT method provides either far greater or equivalent computational efficiency and more certain accuracy than the Euler method. Copyright © 2004 John Wiley & Sons, Ltd.     

A class of B-(p,r)-invex functions and mathematical programming

Invexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-invex functions with respect to η and b, being introduced, includes many well-known classes of generalized invex functions as its subclasses. Some properties of the introduced class of B-(p,r)-invex functions with respect to η and b are studied. Further, mathematical programming problems involving B-(p,r)-invex functions with respect to η and b are considered. The equivalence between saddle points and optima, and different type duality theorems are established for this type of optimization problems.     

考虑次近邻相互作用的正方形点阵完全阻挫XY模型的Ising型相变

利用有限尺寸标度分析方法,研究了考虑次近邻相互作用的正方点阵完全阻挫XY模型的Ising型相变现象.结果表明对于次近邻耦合系数x=0.5的情况,系统存在Ising型相变,临界温度Tc=0.4043±0.0005,临界指数ν=0.80±0.05.     

Invariant Simultaneous Solutions of Evolution Equations of Integrable Hierarchies

We construct classical point symmetry groups for joint pairs of evolution equations (systems of equations) of integrable hierarchies related to the auxiliary equation of the method of the inverse problem of second order. For the two cases: the hierarchy of Korteweg--de Vries (KdV) equations and of the systems of Kaup equations, we construct simultaneous solutions invariant with respect to the symmetry group. The problem of the construction of these solutions can be reduced, respectively, to the first and second Painlevé equations depending on a parameter. The Painlevé equations are supplemented by the linear evolution equations defining the deformation of the solution of the corresponding Painlevé equation.     

Uniform asymptotic regularity for Mann iterates

In Numer. Funct. Anal. Optim. 22 (2001) 641-656, we obtained an effective quantitative analysis of a theorem due to Borwein, Reich, and Shafrir on the asymptotic behavior of general Krasnoselski-Mann iterations for nonexpansive self-mappings of convex sets C in arbitrary normed spaces. We used this result to obtain a new strong uniform version of Ishikawa's theorem for bounded C. In this paper we give a qualitative improvement of our result in the unbounded case and prove the uniformity result for the bounded case under the weaker assumption that C contains a point x whose Krasnoselski-Mann iteration (x_k) is bounded. We also consider more general iterations for which asymptotic regularity is known only for uniformly convex spaces (Groetsch). We give uniform effective bounds for (an extension of) Groetsch's theorem which generalize previous results by Kirk, Martinez-Yanez, and the author.     

Classes of analytic functions subordinate to convex functions and extreme points

In this paper we prove two sufficient conditions for an analytic function f to be an extreme point of the set of functions subordinate to a given convex mapping F when the image of the unit disk under F is a convex domain other than a half-plane, a strip or an infinite wedge.     

两个空间之间复合映射的不动点集和Reidemeister数

设X,Y为拓扑空间,f:X→Y,g:y→X．该文证明了下列结论:对每一自然数n, (1)f(Fix((g o,f)n))=Fix((f o g)n),g(Fix((f og )n))=Fix(g o f)n),且#Fix((g o f)n)= #Fix((f o g)n);(2)R((g o f)n)=R((f o g)n)．     

ON THE EXISTENCE OF POSITIVE ENTIRE SOLUTIONS FOR SINGULAR p-LAPLACE EQUATIONS

In this paper N-dimensional singular, p-Laplace equations of the following form are considered, where p ≥N, β > 0, and f : [0,∞)×(0,∞)×[0, ∞)→[0,∞) is a continuous function. Some sufficient conditions are obtained for the existence of infinitely many radially positive entire solutions of the equation which are asymptotic to positive constant multiples of |x|(p-N)/(p-1) for p > N or log|x| for N = p as |x|→∞.     

Banach代数L∞(T;X)

讨论向量值函数的Banach代数L∞（T；X）的极大理想空间的拓扑性质和代数性质，得到了若干结果；给出了Banach空间H∞（D；X）中闭单位球的端点的一条性质．